Practical Attacks on NESHA-256
نویسندگان
چکیده
NESHA-256 is a cryptographic hash function designed by Esmaeili et al. and presented at WCC ’09. We show that NESHA-256 is highly insecure.
منابع مشابه
NESHA-256, NEw 256-bit Secure Hash Algorithm (Extended Abstract)
In this paper, we introduce a new dedicated 256-bit hash function: NESHA-256. The recently contest for hash functions held by NIST, motivates us to design the new hash function which has a parallel structure. Advantages of parallel structures and also using some ideas from the designing procedure of block-cipher-based hash functions strengthen our proposed hash function both in security and in ...
متن کاملKey Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
AES is the best known and most widely used block cipher. Its three versions (AES-128, AES-192, and AES-256) differ in their key sizes (128 bits, 192 bits and 256 bits) and in their number of rounds (10, 12, and 14, respectively). While for AES-128, there are no known attacks faster than exhaustive search, AES-192 and AES-256 were recently shown to be breakable by attacks which require 2 and 2 t...
متن کاملKey Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds
AES is the best known and most widely used block cipher. Its three versions (AES128, AES-192, and AES-256) differ in their key sizes (128 bits, 192 bits and 256 bits) and in their number of rounds (10, 12, and 14, respectively). In the case of AES-128, there is no known attack which is faster than the 2 complexity of exhaustive search. However, AES-192 and AES-256 were recently shown to be brea...
متن کاملPractical-Titled Attack on AES-128 Using Chosen-Text Relations
Related-key attacks on AES-192 and AES-256 have been presented at Crypto 2009 and Asiacrypt 2009. Although these results are already quite spectacular, they have been extended to practical-complexity attacks on AES variants with 10 rounds at Eurocrypt 2010. These advances in cryptanalysis are enabled by the introduction of a new type of related keys. Let the secret key be denoted by k, the roun...
متن کاملImproved boomerang attacks on round-reduced SM3 and keyed permutation of BLAKE-256
In this paper we study the security of hash functions SM3 and BLAKE-256 against boomerang attack. SM3 is designed by X. Wang et al. and published by Chinese Commercial Cryptography Administration Office for the use of electronic certification service system in China. BLAKE is one of the five finalists of the NIST SHA-3 competition submitted by J.-P. Aumasson et al. For SM3, we present boomerang...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009